Multiple Solutions of H-Systems and Rellich’s Conjecture
نویسندگان
چکیده
where H > 0 is a given constant, y : dR + R3 is a given function and r c R3 is a given oriented Jordan curve. If u is a solution of (H)-(P), then u ( a ) represents a “soap bubble”, that is, a surface with mean curvature H (at all points x c R where V u ( x ) # O ) spanning r. Let us assume that y(aR) (respectively r) is contained in a closed ball of radius R. It was proved by S. Hildebrandt [8] that both the Dirichlet and Plateau problems have at least one solution if HR 4 1 (this was an improvement over earlier results of Heinz [6] and Werner [19]). Moreover this result is sharp when I‘ is a circle: there is no solution of (H)-(P) if HR > 1 (see Heinz [7]). In case r is a circle of radius R and H R c 1 , it is easy to check that there exist two solutions of (H)-(P), namely: 1. the “small” spherical bubble B, of curvature H spanned by r, 2. the “large” spherical bubble Bz of curvature H spanned by r; see Figure 1).
منابع مشابه
MULTIPLE PERIODIC SOLUTIONS FOR A CLASS OF NON-AUTONOMOUS AND CONVEX HAMILTONIAN SYSTEMS
In this paper we study Multiple periodic solutions for a class of non-autonomous and convex Hamiltonian systems and we investigate use some properties of Ekeland index.
متن کاملUpper bounds on the solutions to n = p+m^2
ardy and Littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. They believed that the number $mathcal{R}(n)$ of such representations for $n = p+m^2$ is asymptotically given by begin{equation*} mathcal{R}(n) sim frac{sqrt{n}}{log n}prod_{p=3}^{infty}left(1-frac{1}{p-1}left(frac{n}{p}right)right), end{equation*} where $p$ is a prime, $m$ is a...
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملFlux Distribution in Bacillus subtilis: Inspection on Plurality of Optimal Solutions
Linear programming problems with alternate solutions are challenging due to the choice of multiple strategiesresulting in the same optimal value of the objective function. However, searching for these solutions is atedious task, especially when using mixed integer linear programming (MILP), as previously applied tometabolic models. Therefore, judgment on plurality of optimal m...
متن کامل